Factorized solution of generalized stable Sylvester equations using many-core GPU accelerators

نویسندگان

چکیده

We investigate the factorized solution of generalized stable Sylvester equations such as those arising in model reduction, image restoration, and observer design. Our algorithms, based on matrix sign function, take advantage current trend to integrate high performance graphics accelerators (also known GPUs) computer systems. As a result, our realisations provide valuable tool solve large-scale problems variety platforms.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Factorized Solution of Sylvester Equations with Applications in Control∗

Sylvester equations play a central role in many areas of applied mathematics and in particular in systems and control theory. Here we will show how low-rank solutions for stable Sylvester equations can be computed based on the matrix sign function method. We discuss applications in model reduction as well as in observer design. Numerical experiments demonstrate the efficiency of the proposed me...

متن کامل

On the numerical solution of generalized Sylvester matrix equations

‎The global FOM and GMRES algorithms are among the effective‎ ‎methods to solve Sylvester matrix equations‎. ‎In this paper‎, ‎we‎ ‎study these algorithms in the case that the coefficient matrices‎ ‎are real symmetric (real symmetric positive definite) and extract‎ ‎two CG-type algorithms for solving generalized Sylvester matrix‎ ‎equations‎. ‎The proposed methods are iterative projection metho...

متن کامل

on the numerical solution of generalized sylvester matrix equations

‎the global fom and gmres algorithms are among the effective‎ ‎methods to solve sylvester matrix equations‎. ‎in this paper‎, ‎we‎ ‎study these algorithms in the case that the coefficient matrices‎ ‎are real symmetric (real symmetric positive definite) and extract‎ ‎two cg-type algorithms for solving generalized sylvester matrix‎ ‎equations‎. ‎the proposed methods are iterative projection metho...

متن کامل

On the Numerical Solution of Generalized Sylvester Matrix Equations

The global FOM and GMRES algorithms are among the effective methods to solve Sylvester matrix equations. In this paper, we study these algorithms in the case that the coefficient matrices are real symmetric (real symmetric positive definite) and extract two CG-type algorithms for solving generalized Sylvester matrix equations. The proposed methods are iterative projection methods onto matrix Kr...

متن کامل

The Projected Generalized Sylvester Equations: Numerical Solution and Applications

In this paper we consider the numerical solution of large-scale projected generalized continuous-time and discrete-time Sylvester equations with low-rank right-hand sides. First, we present the results on the sufficient conditions for the existence, uniqueness, and analytic formula of the solutions of these equations. Second, we review the low-rank alternating direction implicit method and the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Journal of Supercomputing

سال: 2021

ISSN: ['0920-8542', '1573-0484']

DOI: https://doi.org/10.1007/s11227-021-03658-y